Diameter of Cayley graphs of permutation groups generated by transposition trees
نویسنده
چکیده
Let Γ be a Cayley graph of the permutation group generated by a transposition tree T on n vertices. In an oft-cited paper [2] (see also [14]), it is shown that the diameter of the Cayley graph Γ is bounded as diam(Γ) ≤ max π∈Sn {
منابع مشابه
Diameters of groups generated by transposition trees
Let G = 〈S〉 be a group, and let Γ be its Cayley graph. Computing the diameter of Γ is a computationally hard problem which comes up in several contexts. Thus, it is useful to be able to compute bounds on the diameter of Cayley graphs. In [1] Ganesan studied the case where S is a minimal set of transpositions which generate G, and provided an algorithm to find an upper bound on diam Γ without ex...
متن کاملNonexistence of efficient dominating sets in the Cayley graphs generated by transposition trees of diameter 3
Let d, n be positive integers such that d < n, and let X n be a Cayley graph generated by a transposition tree of diameter d. It is known that every X n with d < 3 splits into efficient dominating sets. The main result of this paper is that X n does not have efficient dominating sets.
متن کاملNeighbourhood Broadcasting Schemes for Cayley Graphs with Background Traffic
The increase of computationally intensive parallel application has prompted an increase into analysis, design and development of high performance parallel computers. The success of parallel computers is highly dependent on the efficiency of their underlying interconnection networks (INs), and an important feature characterizing the suitability of an IN is the ability to effectively disseminate ...
متن کاملAn efficient algorithm for the diameter of Cayley graphs generated by transposition trees
A problem of practical and theoretical interest is to determine or estimate the diameter of various families of Cayley networks. The previously known estimate for the diameter of Cayley graphs generated by transposition trees is an upper bound given in the oft-cited paper of Akers and Krishnamurthy (1989). In this work, we first assess the performance of their upper bound. We show that for ever...
متن کاملDiameter of Cayley graphs generated by transposition trees
A problem of practical and theoretical interest is to determine or estimate the diameter of various families of Cayley networks. The previously known estimate for the diameter of Cayley graphs generated by transposition trees is an upper bound given in the oft-cited paper of Akers and Krishnamurthy (1989). In this work, we first assess the performance of their upper bound. We show that for ever...
متن کامل